#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:

    int search(vector<int>& nums, int target) {
        int left = 0;
        int right = nums.size() - 1;
        while (left < right) {
            int mid = left / 2 + right / 2;
            if (nums[mid] == target)
                return mid;
            else if (nums[mid] > target)
                right = mid - 1;
            else
                left = mid + 1;
        }
        if (left == right && nums[left] == target)
            return left;
        return -1;
    }
};
int main()
{
	return 0;
}